Cycles inside cycles: Spanish regional aggregation
نویسندگان
چکیده
منابع مشابه
Winter wave climate, storms and regional cycles: the SW Spanish Atlantic coast
Climatic change-related impacts on coastal areas became an important issue in past decades and nowadays threaten many human settlements and activities. Coastal hazards are linked to flooding and erosion processes associated with sea level rise and the increased strength of hurricanes, cyclones and storms. The main aim of this work is the characterization of coastal storms in Cadiz (SW Spain) an...
متن کاملInformation aggregation and investment cycles with strategic complementarity
This paper studies the interaction between information aggregation and investment cycles with investments exhibiting strategic complementarity. The composition of information aggregation varies across different phases of cycles, which in turn affects the course of investment cycles. The phases of cycles are history dependent for informational reasons, and changes in phases depend on the growth ...
متن کاملCycles and Intractability in a Large Class of Aggregation Rules
We introduce the (j, k)-Kemeny rule – a generalization of Kemeny’s voting rule that aggregates j-chotomous weak orders into a k-chotomous weak order. Special cases of (j, k)Kemeny include approval voting, the mean rule and Borda mean rule, as well as the Borda count and plurality voting. Why, then, is the winner problem computationally tractable for each of these other rules, but intractable fo...
متن کاملIndependent cycles and chorded cycles in graphs
In this paper, we investigate sufficient conditions on the neighborhood of independent vertices which imply that a graph contains k independent cycles or chorded cycles. This is related to several results of Corrádi and Hajnal, Justesen, Wang, and Faudree and Gould on graphs containing k independent cycles, and Finkel on graphs containing k chorded cycles. In particular, we establish that if in...
متن کاملClustering Cycles into Cycles of Clusters
In this paper we study simple families of clustered graphs that are highly non connected. We start by studying 3-cluster cycles, that are clustered graphs such that the underlying graph is a simple cycle and there are three clusters all at the same level. We show that in this case testing the c-planarity can be done efficiently and give an efficient drawing algorithm. Also, we characterize 3-cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SERIEs
سال: 2011
ISSN: 1869-4187,1869-4195
DOI: 10.1007/s13209-011-0068-1